Talk:Point-set registration
Appearance
![]() | Point-set registration received a peer review by Wikipedia editors, which is now archived. It may contain ideas you can use to improve this article. |
![]() | A fact from Point-set registration appeared on Wikipedia's Main Page in the Did you know column on 11 October 2013 (check views). The text of the entry was as follows:
| ![]() |
![]() | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||
|
We should add correlation methods
[edit]Real time correlative scan matching: [1]
The method is used in Google's recently open-sourced Cartographer library [2]. dllu (t,c) 03:50, 6 October 2016 (UTC)
New algorithms for noisy Point set registration
[edit]Algorithm quickly finds hidden objects in dense point clouds MIT [3] claims a faster Point set registration algorithm, able to cope with more noise. - Rod57 (talk) 18:23, 21 June 2019 (UTC)
Categories:
- Old requests for peer review
- Wikipedia Did you know articles
- B-Class Computer Vision articles
- Low-importance Computer Vision articles
- All Computer Vision articles
- B-Class Robotics articles
- Low-importance Robotics articles
- WikiProject Robotics articles
- B-Class Computer science articles
- Low-importance Computer science articles
- WikiProject Computer science articles